SYMBOLIC MOMENT CALCULATION FOR THE SOJOURN TIME IN M/G/1 QUEUES WITH BERNOULLI FEEDBACK
نویسندگان
چکیده
منابع مشابه
Sojourn time asymptotics in the MG1 processor sharing queue
We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index −ν, ν non-integer, iff the sojourn time distribution is regularly varying of index −ν. This result is derived from a new expression for the Laplace–Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution...
متن کاملSojourn time asymptotics in processor-sharing queues
Over the past few decades, the Processor-Sharing (PS) discipline has attracted a great deal of attention in the queueing literature. While the PS paradigm emerged in the sixties as an idealization of round-robin scheduling in timeshared computer systems, it has recently captured renewed interest as a useful concept for modeling the flow-level performance of bandwidth-sharing protocols in commun...
متن کاملLarge deviations of the sojourn time for queues in series
We consider an open queueing network consisting of an arbitrary number of queues in series. We assume that the arrival process into the rst queue and the service processes at the individual queues are jointly stationary and ergodic, and that the mean inter-arrival time exceeds the mean service time at each of the queues. Starting from Lindley's recursion for the waiting time, we obtain a simple...
متن کاملQueues with Equally Heavy Sojourn Time and Service Requirement Distributions
For the GGGG1 queue with First-Come First-Served, it is well known that the tail of the sojourn time distribution is heavier than the tail of the service requirement distribution when the latter has a regularly varying tail. In contrast, for the MMGG1 queue with Processor Sharing, Zwart and Boxma 26 showed that under the same assumptions on the service requirement distribution, the two tails ar...
متن کاملSojourn time approximations in queueing networks with feedback
This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number of M multi-server First-Come-First-Served (FCFS) nodes. Customers arrive at the PS according to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1999
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.42.78